北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2007, Vol. 30 ›› Issue (5): 105-107.doi: 10.13190/jbupt.200705.105.wuzhj

• 研究报告 • 上一篇    下一篇

新的高效LDPC码的译码方法

吴湛击;李璐颖;欧阳子月;王文博   

  1. ( 北京邮电大学 电信工程学院, 北京 100876 )
  • 收稿日期:2007-01-26 修回日期:2007-04-04 出版日期:2007-10-30 发布日期:2007-10-30
  • 通讯作者: 吴湛击

Novel Efficient Decoding Implementation of LDPC Codes

WU Zhan-ji, LI Lu-ying, OUYANG Zi-yue,WANG Wen-bo   

  1. (School of Telecommunication Engineering, Beijing University of Post and Telecommunications,Beijing100876,China)
  • Received:2007-01-26 Revised:2007-04-04 Online:2007-10-30 Published:2007-10-30
  • Contact: WU Zhan-ji

摘要:

对于LDPC码的译码算法——和积算法,提出了一种新的基于差分的译码算法,其主要思想是:在LDPC码的二部图上所传递的消息是概率的差分值,而对于校验节点和消息节点的更新都是在特定的加法域中进行. 针对校验节点的更新,还可以选择若干个绝对值最小的差分值进行运算,以进一步降低复杂度. 与传统的基于对数似然比的译码方法相比,新算法的计算复杂度有很大降低,而译码性能和收敛速度没有明显损失.

关键词: LDPC码, 和积译码算法, 差分译码算法

Abstract:

As for the sum-product decoding algorithm of low density parity check (LDPC) codes, a difference-based decoding method is proposed. The main idea is shown as follows: the messages passed on the bipartite graph of LDPC are based on the probability differences,and the updates of both check nodes and message nodes are carried out on some special addition domain. As for the update of check nodes, only some lowest differences can be selected for reducing computational complexity. In contrast with the traditional log-likelyhood-ratio-based(LLR-based) decoding method, the proposed method has much lower complexity, while it has no obvious loss of performance and convergence.

Key words: low density parity check codes, sum-product decoding algorithm, difference-based decoding algorithm

中图分类号: